(R, S) conjugate solution to coupled Sylvester complex matrix equations with conjugate of two unknowns

نویسندگان

چکیده

In this work, we are concerned with (R, S) – conjugate solutions to coupled Sylvester complex matrix equations of two unknowns. When the considered consistent, it is demonstrated that can be obtained by utilizing iterative algorithm for any initial arbitrary (R,S) matrices V1,W1. A necessary and sufficient condition established guarantee proposed method converges solutions. Finally, numerical examples provided demonstrate efficiency described technique.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite iterative algorithms for extended Sylvester-conjugate matrix equations

An iterative algorithm is presented for solving the extended Sylvester-conjugate matrix equation. By this iterativemethod, the solvability of thematrix equation can be determined automatically. When the matrix equation is consistent, a solution can be obtained within finite iteration steps for any initial values in the absence of round-off errors. The algorithm is also generalized to solve a mo...

متن کامل

Iterative algorithm for the generalized ‎$‎(P‎,‎Q)‎$‎-reflexive solution of a‎ ‎quaternion matrix equation with ‎$‎j‎$‎-conjugate of the unknowns

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

On the Hermitian R-Conjugate Solution of a System of Matrix Equations

Let R be an n by n nontrivial real symmetric involution matrix, that is, R R−1 R / In. An n × n complex matrix A is termed R-conjugate if A RAR, where A denotes the conjugate of A. We give necessary and sufficient conditions for the existence of the Hermitian R-conjugate solution to the system of complex matrix equations AX C andXB D and present an expression of the Hermitian R-conjugate soluti...

متن کامل

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatika

سال: 2022

ISSN: ['0005-1144', '1848-3380']

DOI: https://doi.org/10.1080/00051144.2022.2052399